<?php
// +----------------------------------------------------------------------
// | ThinkPHP [ WE CAN DO IT JUST THINK ]
// +----------------------------------------------------------------------
// | Copyright (c) 2006-2016 http://thinkphp.cn All rights reserved.
// +----------------------------------------------------------------------
// | Licensed ( http://www.apache.org/licenses/LICENSE-2.0 )
// +----------------------------------------------------------------------
// | Author: 流年 <liu21st@gmail.com>
// +----------------------------------------------------------------------

// 应用公共文件
function tree($data,$pid = 0){
    $terr = [];
    if($data){

        foreach ($data as $k=>$v){
            if($v->pid == $pid){
                $v['child'] = tree($data, $v['id']);
                $terr[] = $v;
            }
        }
    }
    return $terr;
}
//递归一维
function  one_tree($data,$pid = 0,$level = 0){
    static $tree = [];
    if($data){
        foreach ($data as $k=>$v){
            if($v->pid == $pid){
                $v['level'] = $level;
                $tree[] = $v;
                one_tree($data,$v->id,$level+1);
            }
        }
    }
    return $tree;



}